Scatter Search and Graph Heuristics for the Examination Timetabling Problem
نویسندگان
چکیده
Examination timetabling problem is an optimization problem which consists in assigning a set of exams to a set of contiguous time slot, satisfying a set of constraints. The problem falls in the category of the NP-Complete problems and is usually tackled using heuristic methods. In this paper we describe a solution algorithm and its implementation based on the graph heuristics and the evolutionary meta-heuristic called scatter search which operates on a set of solutions by combining two or more elements. New solutions are improved before replacing others according to their quality and diversity. The implementation of the algorithm has been experimented on the popular carter’s benchmarks and compared with the best recent results.
منابع مشابه
A new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملAnalysing the High Level Heuristics within a Graph Based Hyper-heuristic
This paper presents our work on analysing high level heuristics within a graph based hyper-heuristic framework. Local search based methods (Tabu Search and steepest descent method) are compared as the high level heuristics within the graph based hyper-heuristic framework and the analysis of their neighborhood structures and performance on the high level landscape is carried out. An iterated ste...
متن کاملA Genetic Programming Approach to the Generation of Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem
Research in the field of examination timetabling has developed in two directions. The first looks at applying various methodologies to induce examination timetables. The second takes an indirect approach to the problem and examines the generation of heuristics or combinations of heuristics, i.e. hyper-heuristics, to be used in the construction of examination timetables. The study presented in t...
متن کاملCase Based Heuristic Selection for Examination Timetabling
The work presented in this paper could be thought of as a case based hyper-heuristic approach for examination timetabling problems. A hyper-heuristic can be taken to be an automated approach to choose heuristics. Heuristics and meta-heuristics are employed in this capacity in [1] and [2]. In this paper the case-based paradigm is explored as a heuristic selector for examination timetabling probl...
متن کاملHybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems
This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyperheuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic ...
متن کامل